Entangled Simultaneity Versus Classical Interactivity in Communication Complexity
نویسندگان
چکیده
منابع مشابه
Quantum versus classical simultaneity in communication complexity
We present a bipartite partial function c̃Eq-negT , whose communication complexity is O ( (logn) ) in the model of quantum simultaneous message passing (Q‖,pub) and Ω̃(√n) in the model of randomised simultaneous message passing (R‖,pub). In fact, our function has a poly-logarithmic protocol even in the (restricted) model of quantum simultaneous message passing without shared randomness (Q‖), thus...
متن کامل2 Classical Communication Complexity
Can quantum communication be more efficient than its classical counterpart? Holevo’s theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits—unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational task...
متن کاملDirect Sum Questions in Classical Communication Complexity
In 1988, Karchmer and Wigderson generalized Yao’s two-party communication model of functions to relations and showed a remarkable connection of this model to the Boolean circuit model. A few years later, continuing this line of work, Karchmer, Raz, and Wigderson proposed a program to separate NC from P through direct-sum-type inequalities in communication complexity. This spurred the study of t...
متن کاملUsefulness of classical communication for local cloning of entangled states
Rafał Demkowicz-Dobrzański, Maciej Lewenstein, Aditi Sen De , Ujjwal Sen, and Dagmar Bruß Center for Theoretical Physics, Polish Academy of Sciences Aleja Lotników 32/44, 02-668 Warszawa, Poland ICREA and ICFO-Institut de Ciències Fotòniques, E-08860 Castelldefels, Barcelona, Spain Institut für Theoretische Physik, Universität Hannover, D-30167 Hannover, Germany ICFO-Institut de Ciències Fotòni...
متن کاملUnbounded-Error Classical and Quantum Communication Complexity
Since the seminal work of Paturi and Simon [26, FOCS’84 & JCSS’86], the unboundederror classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently, [14, ICALP’07] found that the unboundederror quantum communication complexity in the one-way communication model can also be investigated using the arrangement, and showed th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2976074